Metaheuristics “In the Large”

Metaheuristics for large-scale instances of the linear ordering problem

This paper presents iterated local search and great deluge trajectory metaheuristics for the linear ordering problem (LOP). Both metaheuristics are based on the TREE local search method introduced in Sakuraba and Yagiura, 2010 (Efficient local search algorithms for the linear ordering problem, International Transactions in Operational Research 17, pp. 711–737) that is the only method ever appli...

Metaheuristics in large-scale global continues optimization: A survey

Metaheuristic algorithms are extensively recognized as effective approaches for solving high-dimensional optimization problems. These algorithms provide effective tools with important applications in business, engineering, economics, and science. This paper surveys state-of-the-art metaheuristic algorithms and their current applications in the field of large-scale global optimization. The paper...

Application of Metaheuristics to Large-Scale Transportation Problems

A Survey on Metaheuristics for Solving Large Scale Optimization Problems

In recent years, there has been a remarkable improvement in the computing power of computers. As a result, numerous realworld optimization problems in science and engineering, possessing very high dimensions, have appeared. In the research community, they are generally labeled as Large Scale Global Optimization (LSGO) problems. Several Metaheuristics has been proposed to tackle these problems. ...

Metaheuristics - the metaphor exposed

In recent years, the field of combinatorial optimization has witnessed a true tsunami of “novel” metaheuristic methods, most of them based on a metaphor of some natural or man-made process. The behavior of virtually any species of insects, the flow of water, musicians playing together – it seems that no idea is too far-fetched to serve as inspiration to launch yet another metaheuristic. In this...